Cluster algebra

Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky (2002, 2003, 2007). A cluster algebra of rank n is an integral domain A, together with some subsets of size n called clusters whose union generates the algebra A and which satisfy various conditions.

1 Definitions
2 Examples
3 References
4 External links

Definitions

Suppose that F is an integral domain, such as the field Q(x₁,...,x_n) of rational functions in n variables over the rational numbers Q.

A cluster of rank n consists of a set of n elements {x, y, ...} of F, usually assumed to be an algebraically independent set of generators of a field extension F.

A seed consists of a cluster {x,y,...} of F, together with an exchange matrix B with integer entries b_x,y indexed by pairs of elements x, y of the cluster. The matrix is sometimes assumed to be skew symmetric, so that b_x,y = –b_y,x. More generally the matrix might be skew symmetrizable, meaning there are positive integers d_x associated with the elements of the cluster such that d_xb_x,y = –d_yb_y,x. It is common to picture a seed as a quiver with vertices the generating set, by drawing b_x,y arrows from x to y if this number is positive. When b_x,y is skew symmetrizable the quiver has no loops or 2-cycles.

A mutation of a seed, depending on a choice of vertex y of the cluster, is a new seed given by a generalization of tilting as follows. Exchange the values of b_x,y and b_y,x for all x in the cluster. If b_x,y > 0 arrows and b_y,z > 0 then replace b_x,z by b_x,yb_y,z + b_x,z. Finally replace y by a new generator w, where

$wy=\prod_{t,b_{t,y}>0}t^{b_{t,y}} %2B \prod_{t,b_{t,y}<0}t^{-b_{t,y}}$

where the products run through the elements t in the cluster of the seed such that b_t,y is positive or negative respectively. The inverse of a mutation is also a mutation: in other words, if A is a mutation of B, then B is a mutation of A.

A cluster algebra is constructed from a seed as follows. If we repeatedly mutate the seed in all possible ways, we get a finite or infinite graph of seeds, where two seeds are joined if one can be obtained by mutating the other. The underlying algebra of the cluster algebra is the algebra generated by all the clusters of all the seeds in this graph. The cluster algebra also comes with the extra structure of the seeds of this graph.

A cluster algebra is said to be of finite type if it has only a finite number of seeds. Fomin & Zelevinsky (2003) showed that the cluster algebras of finite type can be classified in terms of the Dynkin diagrams of finite dimensional simple Lie algebras.

Examples

Cluster algebras of rank 1

If {x} is the cluster of a seed of rank 1, then the only mutation takes this to {2x^–1}. So a cluster algebra of rank 1 is just a ring k[x,x^–1] of Laurent polynomials, and it has just two clusters, {x} and {2x^–1}. In particular it is of finite type and is associated with the Dynkin diagram A₁.

Cluster algebras of rank 2

Suppose that we start with the cluster {x₁, x₂} and take the exchange matrix with b₁₂=–b₂₁=1. Then mutation gives a sequence of variables x₁, x₂, x₃, x₄,... such that the clusters are given by adjacent pairs {x_n,x_n+1}. The variables are related by

$\displaystyle x_{n-1}x_{n%2B1}=1%2Bx_n$

so are given by the sequence

$x_1, x_2, x_3=\frac{1%2Bx_2}{x_1}, x_4=\frac{1%2Bx_3}{x_2}=\frac{1%2Bx_1%2Bx_2}{x_1x_2}, x_5=\frac{1%2Bx_4}{x_3}=\frac{1%2Bx_1}{x_2}, x_6=\frac{1%2Bx_5}{x_4}=x_1,x_7=\frac{1%2Bx_6}{x_5}=x_2,\ldots$

which repeats with period 5. So this cluster algebra has exactly 5 clusters, and in particular is of finite type. It is associated with the Dynkin diagram A₂.

There are similar examples with b₁₂ = 1, –b₂₁ = 2 or 3, where the analogous sequence of cluster variables repeats with period 6 or 8. These are also of finite type, and are associated with the Dynkin diagrams B₂ and G₂. However if |b₁₂b₂₁| ≥ 4 then the sequence of cluster variables is not periodic and the cluster algebra is of infinite type.

Cluster algebras of rank 3

Suppose we start with the quiver x₁→x₂→x₃. Then the 14 clusters are:

$\left\{ x_1,x_2,x_3 \right\},$

$\left\{\frac{1%2Bx_2}{x_1},x_2,x_3 \right\},$

$\left\{x_1, \frac{x_1 %2B x_3}{x_2},x_3 \right\},$

$\left\{x_1,x_2,\frac{1%2Bx_2}{x_3}\right\},$

$\left\{\frac{1%2Bx_2}{x_1}, \frac{x_1 %2B(1%2Bx_2)x_3}{x_1 x_2},x_3 \right\},$

$\left\{\frac{1%2Bx_2}{x_1},x_2,\frac{1%2Bx_2}{x_3} \right\},$

$\left\{\frac{x_1%2B(1%2Bx_2)x_3}{x_1x_2},\frac{x_1 %2B x_3}{x_2},x_3 \right\},$

$\left\{x_1,\frac{x_1%2Bx_3}{x_2},\frac{(1%2Bx_2)x_1%2Bx_3}{x_2x_3} \right\},$

$\left\{x_1,\frac{(1%2Bx_2)x_1 %2B x_3}{x_2 x_3},\frac{1%2Bx_2}{x_3} \right\},$

$\left\{\frac{1%2Bx_2}{x_1},\frac{x_1%2B(1%2Bx_2)x_3}{x_1 x_2},\frac{(1%2Bx_2)x_1 %2B(1%2Bx_2)x_3}{x_1 x_2x_3}\right\},$

$\left\{\frac{1%2Bx_2}{x_1},\frac{(1%2Bx_2)x_1 %2B(1%2Bx_2)x_3}{x_1 x_2x_3}, \frac{1%2Bx_2}{x_3} \right\},$

$\left\{\frac{x_1%2B(1%2Bx_2)x_3}{x_1x_2},\frac{x_1%2Bx_3}{x_2},\frac{(1%2Bx_2)x_1%2B(1%2Bx_2)x_3}{x_1 x_2 x_3} \right\},$

$\left\{\frac{(1%2Bx_2)x_1 %2B(1%2Bx_2)x_3}{x_1 x_2x_3},\frac{x_1%2Bx_3}{x_2},\frac{(1%2Bx_2)x_1%2Bx_3}{x_2 x_3} \right\},$

$\left\{\frac{(1%2Bx_2)x_1%2B(1%2Bx_2)x_3}{x_1 x_2 x_3},\frac{(1%2Bx_2)x_1%2Bx_3}{x_2 x_3},\frac{1%2Bx_2}{x_3} \right\}.$

There are 6 cluster variables other than the 3 initial ones x₁, x₂, x₃ given by

$\frac{1%2Bx_2}{x_1},\frac{x_1 %2B x_3}{x_2},\frac{1%2Bx_2}{x_3}, \frac{x_1%2B(1%2Bx_2)x_3}{x_1x_2}, \frac{(1%2Bx_2)x_1%2Bx_3}{x_2 x_3}, \frac{(1%2Bx_2)x_1 %2B(1%2Bx_2)x_3}{x_1 x_2x_3}$ .

They correspond to the 6 positive roots of the Dynkin diagram A₃: more precisely the denominators are monomials in x₁, x₂, x₃, corresponding to the expression of positive roots as the sum of simple roots. The 3+6 cluster variables generate a cluster algebra of finite type, associated with the Dynkin diagram A₃. The 14 clusters are the vertices of the cluster graph, which is an associahedron.

Grassmannians

Simple examples are given by the algebras of homogeneous functions on the Grassmannians. The Plücker coordinates provide some of the distinguished elements.

For the Grassmannian of planes in ℂⁿ, the situation is even more simple. In that case, the Plücker coordinates provide all the distinguished elements and the clusters can be completely described using triangulations of a regular polygon with n vertices. More precisely, clusters are in one-to-one correspondence with triangulations and the distinguished elements are in one-to-one correspondence with diagonals (line segments joining two vertices of the polygon). One can distinguish between diagonals in the boundary, which belong to every cluster, and diagonals in the interior. This corresponds to a general distinction between coefficient variables and cluster variables.

References

Berenstein, Arkady; Fomin, Sergey; Zelevinsky, Andrei (2005), "Cluster algebras. III. Upper bounds and double Bruhat cells", Duke Mathematical Journal 126 (1): 1–52, doi:10.1215/S0012-7094-04-12611-9, MR 2110627
Fomin, Sergey; Zelevinsky, Andrei (2002), "Cluster algebras. I. Foundations", Journal of the American Mathematical Society 15 (2): 497–529, doi:10.1090/S0894-0347-01-00385-X, MR 1887642
Fomin, Sergey; Zelevinsky, Andrei (2003), "Cluster algebras. II. Finite type classification", Inventiones Mathematicae 154 (1): 63–121, doi:10.1007/s00222-003-0302-y, MR 2004457
Fomin, Sergey; Zelevinsky, Andrei (2007), "Cluster algebras. IV. Coefficients", Compositio Mathematica 143 (1): 112–164, doi:10.1112/S0010437X06002521, MR 2295199
Fomin, Sergey; Reading, Nathan (2007), "Root systems and generalized associahedra", in Miller, Ezra; Reiner, Victor; Sturmfels, Bernd, Geometric combinatorics, IAS/Park City Math. Ser., 13, Providence, R.I.: Amer. Math. Soc., arXiv:math/0505518, ISBN 9780821837368, MR 2383126
Reiten, Idun (2010), Tilting theory and cluster algebras, Trieste Proceedings of Workshop, http://arxiv.org/abs/1012.6014
Zelevinsky, Andrei (2007), "What Is . . . a Cluster Algebra?", AMS Notices 54 (11): 1494–1495, http://www.ams.org/notices/200711/tx071101494p.pdf .